Partial correlation graphical LASSO

نویسندگان

چکیده

Abstract Standard likelihood penalties to learn Gaussian graphical models are based on regularizing the off‐diagonal entries of precision matrix. Such methods, and their Bayesian counterparts, not invariant scalar multiplication variables, unless one standardizes observed data unit sample variances. We show that such standardization can have a strong effect inference introduce new family partial correlations. latter, as well maximum likelihood, logarithmic scale invariant. illustrate use penalty, correlation LASSO, which sets an penalty The associated optimization problem is no longer convex, but conditionally convex. via simulated examples in two real datasets that, besides being invariant, there be important gains terms inference.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fused Multiple Graphical Lasso

In this paper, we consider the problem of estimating multiple graphical models simultaneously using the fused lasso penalty, which encourages adjacent graphs to share similar structures. A motivating example is the analysis of brain networks of Alzheimer’s disease using neuroimaging data. Specifically, we may wish to estimate a brain network for the normal controls (NC), a brain network for the...

متن کامل

Pathway Graphical Lasso

Graphical models provide a rich framework for summarizing the dependencies among variables. The graphical lasso approach attempts to learn the structure of a Gaussian graphical model (GGM) by maximizing the log likelihood of the data, subject to an l1 penalty on the elements of the inverse co-variance matrix. Most algorithms for solving the graphical lasso problem do not scale to a very large n...

متن کامل

Robust Gaussian Graphical Modeling with the Trimmed Graphical Lasso

Gaussian Graphical Models (GGMs) are popular tools for studying network structures. However, many modern applications such as gene network discovery and social interactions analysis often involve high-dimensional noisy data with outliers or heavier tails than the Gaussian distribution. In this paper, we propose the Trimmed Graphical Lasso for robust estimation of sparse GGMs. Our method guards ...

متن کامل

Equivalent Partial Correlation Selection for High Dimensional Gaussian Graphical Models

Gaussian graphical models (GGMs) are frequently used to explore networks, such as gene regulatory networks, among a set of variables. Under the classical theory of GGMs, the graph construction amounts to finding the pairs of variables with nonzero partial correlation coefficients. However, this is infeasible for high dimensional problems for which the number of variables is larger than the samp...

متن کامل

Coordinate descent algorithm for covariance graphical lasso

Bien and Tibshirani (2011) have proposed a covariance graphical lasso method that applies a lasso penalty on the elements of the covariance matrix. This method is definitely useful because it not only produces sparse and positive definite estimates of the covariance matrix but also discovers marginal independence structures by generating exact zeros in the estimated covariance matrix. However, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Scandinavian Journal of Statistics

سال: 2023

ISSN: ['0303-6898', '1467-9469']

DOI: https://doi.org/10.1111/sjos.12675